Exploiting Local Popularity To Prune Routing Indices In Peer-to-Peer System
نویسندگان
چکیده
Routing in unstructured peer-to-peer system relies either on broadcasting (also called flooding) or on Routing Indices. An approach using Routing Indices is only scalable if the Routing Indices are of manageable size. In this paper, we present a strategy to prune Routing Indices based on the popularity of resources. The Routing Indices maintain routing information for queries to the most popular resources only. Queries to other resources are routed randomly. The popularity of resources is learned at each node of the network for each Routing Index thanks to a replacement strategy. We comparatively evaluate the performance of the local popularity method with the one of a global popularity method for the pruning of Routing Indices in both static and dynamic environments. We compare the effectiveness of two standard replacement strategies: Least Frequently Used (LFU) and Least Recently Used (LRU). Our results confirm the efficiency and effectiveness of the pruning of Routing Indices based on local popularity of resources in unstructured peer-to-peer networks.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملAdaptive Peer-to-Peer Routing with Proximity
In this paper, we presented a routing strategy for requests in unstructured peer-to-peer networks. The strategy is based on the adaptive routing Q-routing. The strategy uses reinforcement learning to estimate the cost of routing a request. Such a strategy is scalable only if the routing indices are of reasonable size. We proposed and comparatively evaluated three methods for the pruning for the...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملExploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks
Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query rout...
متن کامل